Systems and methods that utilize machine learning algorithms to facilitate assembly of aids vaccine cocktails

ABSTRACT

The subject invention provides systems and methods that facilitate AIDS vaccine cocktail assembly via machine learning algorithms such as a cost function, a greedy algorithm, an expectation-maximization (EM) algorithm, etc. Such assembly can be utilized to generate vaccine cocktails for species of pathogens that evolve quickly under immune pressure of the host. For example, the systems and methods of the subject invention can be utilized to facilitate design of T cell vaccines for pathogens such HIV. In addition, the systems and methods of the subject invention can be utilized in connection with other applications, such as, for example, sequence alignment, motif discovery, classification, and recombination hot spot detection. The novel techniques described herein can provide for improvements over traditional approaches to designing vaccines by constructing vaccine cocktails with higher epitope coverage, for example, in comparison with cocktails of consensi, tree nodes and random strains from data.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation-in Part of U.S. patent application Ser. No. 10/977,415, entitled “SYSTEMS AND METHODS THAT UTILIZE MACHINE LEARNING ALGORITHMS TO FACILITATE ASSEMBLY OF AIDS VACCINE COCKTAILS,” filed Oct. 29, 2004. This application is also related to U.S. patent application Ser. No. ______, entitled, “SYSTEMS AND METHODS THAT UTILIZE MACHINE LEARNING ALGORITHMS TO FACILITATE ASSEMBLY OF AIDS VACCINE COCKTAILS”, filed Dec. 30, 2005 (Atty. Docket No. MS310534.05/MSFTP784USB). The entireties of the aforementioned applications are incorporated herein by reference.

BACKGROUND

The human body has the ability to develop extremely powerful specific immunity against individual invading agents such as lethal bacteria, viruses, toxins, etc. This ability is typically referred to as acquired immunity. In general, two basic but closely allied types of acquired immunity occur in the body. In one type, the body develops circulating antibodies (referred to as bursal, or B lymphocytes), which are globulin molecules that are capable of attacking an invading agent. This type of acquired immunity is referred to as humoral immunity. The other type of acquired immunity is achieved through the formation of large numbers of activated lymphocytes (referred to as thymic, or T lymphocytes or T cells) that are specifically designed to destroy a foreign agent. This type of immunity is called cell-mediated immunity.

Upon exposure to particular antigens, T lymphocytes of the lymphoid tissue proliferate and release large numbers of activated T cells. These T cells pass into the circulation and are distributed throughout the body, passing through the capillary walls into the tissue spaces, back into the lymph and blood once again, and circulating again and again throughout the body, sometimes lasting for month or even years. In addition, T lymphocyte memory cells are formed and preserved in the lymphoid tissue and become additional T lymphocytes of that specific clone. These additional T lymphocytes can spread throughout the lymphoid tissue of the body, and, on subsequent exposure to the same antigen, the release of activated T cells can occur far more rapidly and much more powerfully than in a first response.

Cytotoxic T cells are direct attack cells that are capable of killing microorganisms and the body's own cells and, thus, are often referred to as “killer” cells. In general, the receptor proteins on the surfaces of the cytotoxic cells cause them to bind tightly to those organisms or cells that contain their binding-specific antigen. In the instance of the Human Immunodeficiency Virus (HIV), the immune system of the infected human produces killer T-cells that recognize epitopes (patterns of 8-11 amino acids) on the surface of T cells infected by HIV and bind thereto. The immediate affect of the binding is swelling of the T cell and release of cytotoxic substances into the attacked cell with eventual destruction of the cell. Cytotoxic T cells are especially lethal to tissue cells that have been invaded by viruses since many virus particles become entrapped in the membranes of these cells and attract the T cells due to viral antigenicity.

Through exposure to pathogen or pathogen-like proteins, the adaptive immune system can be primed to react to as many foreign amino acid patterns as possible, given resource and specificity constraints. Such exposure can be achieved through vaccines, which have been used for many years to cause acquired immunity against specific diseases.

Pathogen evolution typically converges to a balance between avoiding detection and preserving functionality. As the immune system has a localized effect on the pathogen's genome, the evolution will be different in different hosts and different in different parts of the pathogen's proteins. With traditional approaches to designing vaccines for rapidly evolving pathogens, evolution typically is modeled as a process of random site-independent mutations, wherein total mutation in a genome or an entire protein is assumed to capture evolutionary distance between a pair of sequences. However, the environment can affect disparate pieces of the genome and/or peptides in a protein differently. On the population level, this can lead to creation of several functional versions of each piece that are essentially arbitrarily combined into a whole protein. The combinatorial growth of functional forms of the protein creates an impression of immense diversity when mutation is averaged over the genome. Another deficiency with traditional approaches is the log mutation scores for sites in a sequence are summed together (or mutation probabilities are all multiplied together) to define a number corresponding to an evolutionary distance between two sequences when separate pieces commonly have different evolutionary distances. Thus, there is a need for improved techniques that facilitate vaccine assembly.

SUMMARY

The following presents a simplified summary of the invention in order to provide a basic understanding of some aspects of the invention. This summary is not an extensive overview of the invention. It is intended to neither identify key or critical elements of the invention nor delineate the scope of the invention. Its sole purpose is to present some concepts of the invention in a simplified form as a prelude to the more detailed description that is presented later.

The subject invention provides system and methods that facilitate vaccine cocktail assembly via machine learning techniques that model sequence diversity. Such assembly can be utilized to generate vaccine cocktails for species of pathogens that evolve quickly under immune pressure of the host. For example, the systems and methods of the subject invention can be utilized to facilitate design of T cell vaccines for pathogens such HIV. In addition, the systems and methods of the subject invention can be utilized with other applications, such as, for example, sequence alignment, motif discovery, classification, and recombination hot spot detection.

A resultant vaccine cocktail can be referred to as an “epitome,” or a sequence that includes all or many of the short subsequences from a large set of sequence data, or population. The novel techniques described herein can provide for improvements over traditional approaches that utilize an ancestral sequence from which diversity mushroomed, an average sequence of a population, or a “best” sequence a population. For example, vaccine cocktails generated by the systems and methods of the subject invention can provide for higher epitope coverage in comparison with the cocktails of consensi, phylogenetic tree nodes and random strains from the data. In addition, consensus models and/or phylogenetic tree models are not well-suited to accounting for the large amount of local diversity in HIV.

In one aspect, a system and/or method that determines epitomes for rapidly evolving pathogens is provided. The system can include an input component that receives a plurality of patches (e.g., sequences of DNA, RNA, or protein, etc.). Such patches can be a subset or all of a population of patches. The received patches can be variable length and conveyed by the input component to a modeling engine. The modeling engine can employ various learning algorithms (e.g., expectation-maximization (EM), greedy, Bayesian, Hidden Markov, etc.) to determine the epitome. For example, the modeling engine can determine a most likely epitome, such as, a sequence (e.g., with the greatest coverage and a shortest sequence for a particular coverage. Upon determining the epitome, it can be sequenced to create a peptide and/or nucleotide.

In another aspect of the subject invention, systems and methods are provided for designing AIDS/HIV vaccine cocktail. In one instance, the methods include obtaining AIDS sequence data of contiguous amino acid subsequences (e.g., all possible subsequences with length that corresponds to a typical epitope), building a plurality of disparate sized patches from the sequence data by iteratively increasing a size of a patch while decreasing an associated free energy (e.g., set equal to zero), aggregating patches to form the AIDS vaccine cocktail by adding a most frequent patch during each iteration unless the patch was already added. An expectation-maximization (EM) and/or a greedy algorithm can be utilized to optimize respective iterations. In another instance, the methods include receiving a plurality of HIV related sequences, utilizing the sequences, based on their linear nine-amino acid epitopes (e.g., substantially equally immunogenic), to create a compact representation of a large number of HIV related peptides, employing a machine learning algorithm to optimize the representation in terms of binding energies, and designing an HIV vaccine cocktail based on the representation. Alternatively, the representation can be estimated from the sequence by parsing the sequences into shorter peptides and creating a mosaic sequence that is longer than any individual sequence.

In yet another instance, the systems include a component that receives a plurality of HIV related nine-mers, a component that generates a sequence that epitomizes the plurality of nine-mers, a component that employs a greedy algorithm (e.g., initialized with a random nine-mer and a variable binding energy estimate) to jointly update a size of the sequence and a free energy, and a component that utilizes the updated sequence to design an HIV vaccine cocktail. Additionally or alternatively, an expectation-maximization algorithm that concurrently optimizes the updated sequence and a binding energy can be utilized.

The following description and the annexed drawings set forth in detail certain illustrative aspects of the invention. These aspects are indicative, however, of but a few of the various ways in which the principles of the invention may be employed and the present invention is intended to include all such aspects and their equivalents. Other advantages and novel features of the invention will become apparent from the following detailed description of the invention when considered in conjunction with the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an exemplary system that employs machine learning to determine epitomes for rapidly evolving pathogens.

FIG. 2 illustrates an exemplary system that utilizes a cost function to facilitate determining epitomes.

FIG. 3 illustrates an exemplary system that utilizes an expectation-maximization (EM) algorithm to facilitate determining epitomes.

FIG. 4 illustrates an exemplary method for determining epitomes.

FIG. 5 illustrates an exemplary epitome.

FIG. 6 is a graph depicting gene coverage versus length.

FIG. 7 is a graph depicting epitope coverage versus length.

FIG. 8 illustrates an exemplary operating environment.

DETAILED DESCRIPTION

The subject invention relates to systems and methods that utilize machine learning to model sequence diversity to facilitate vaccine cocktail assembly. Suitable machine learning techniques include cost functions, expectation-maximization (EM) and greedy algorithms, for example. Such assembly can be utilized to generate vaccine cocktails for species of pathogens that evolve quickly under immune pressure of the host. For example, the systems and methods of the subject invention can be utilized to facilitate design of T cell vaccines for pathogens such HIV.

The present invention is described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It may be evident, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing the present invention.

As utilized herein, the terms “epitome,” “sequence,” “instance of a model,” and the like generally refers to a sequence that includes all or many of the short subsequences (patches) from a large set or population of sequence data and/or a sequence whose subsequences (patches) can be assembled to generate a wide range of representative sequences of a desired category. Suitable categories include sequences associated with a specific species, such as HIV, sequences from a specific clade, and/or sequences associated with an acute or chronic phase of infection.

FIG. 1 illustrates a system 100 that determines epitomes (vaccine cocktails) for rapidly evolving pathogens such as HIV. The system 100 comprises an input component 110 and a modeling engine 120. The input component 110 can receive a plurality of patches that can be a subset or all of a population of patches, wherein such patches can be utilized to construct an epitome. The received patches can be variable length, for example, nine-mers, ten-mers, etc. The input component 110 can convey the patches to the modeling engine 120, which can employ various learning algorithms (e.g., expectation-maximization (EM), greedy, Bayesian, Hidden Markov, etc.) that can utilize the patches to determine the epitome. For example, the modeling engine 120 can be utilized to determine a most likely epitome. In one instance, the most likely epitome is defined as the sequence with the greatest coverage. In another instance, the most likely epitome is defined as the shortest sequence for a particular coverage. Upon determining the epitome, it can be utilized to create peptide and/or nucleotide sequencing.

Traditional approaches to designing such vaccines typically model evolution as a process of random site-independent mutations. However, the environment can affect different pieces of the genome and/or peptides in a single protein differently. On the population level, this can lead to creation of several functional versions of each piece and an impression of immense diversity. In addition, with traditional approaches the log mutation scores for sites in a sequence are summed together or mutation probabilities are multiplied together to define a number corresponding to an evolutionary distance between two sequences, when separate pieces commonly have different evolutionary distances. The novel approach employed by the system 100 can provide for improvements over traditional technique via utilizing machine learning techniques. By way of example, the system 100 can be employed to model sequence diversity to facilitate generating of vaccine cocktails. Such cocktails can provide for higher epitope coverage in comparison with the cocktails of consensi, phylogenetic tree nodes and random strains from the data.

FIG. 2 illustrates a system 200 that determines epitomes via a cost function. The system 200 comprises an input component 210, a modeling engine 220, and a learning component 230. The input component 210 can receive patches associated with a population and convey the patches to the modeling engine 120, which can utilize the patches to determine the epitome. The modeling component 220 can employ the learning component 230 to facilitate determining the epitome.

In one aspect of the subject invention, the learning component 230 can employ a cost function 240 to learn the epitome. For example, the learning component 230 can employ a cost function that measures the similarity of sequence data with an estimate of the epitome. By way of example, a set of nucleotide or amino acid patches defined by x={x_(ij)}, wherein i=1, . . . , M (M is a sequence index) and j=1, . . . , N (N is a site (position) index) can be received by the input component 210 and conveyed to the modeling component 220. The modeling component 220 can utilize the patches to construct an M×N matrix/array of sequence data (an epitome) that can be input to a learning algorithm that renders the epitome as a smaller array e={e_(mn)} of size Me×Ne, wherein MeNe<<MN. For example, the data can include 12 sequences (M=12) with lengths of about 42 (N=42), whereas the epitome size after utilizing the learning algorithm can be reduced to Me=1 and Ne=50. It is to be appreciated that the values utilized in the above example are illustrative and do not limit the invention. Moreover, it is to be appreciated that the learning algorithm can optimize the epitome in order to maximize a number of short subsequences that are present in the input data, and the input data can be described by its epitome and a mapping that links the sites in the data to sites in the epitome.

In order to establish such mapping, the sequence set (patches) x can be represented as a set of short overlapping subsequences, wherein respective subsequence x_(S) can include letters from a subset of sequence positions S. Each index in an index set S generally is two dimensional, pointing both to a sequence and a position within the sequence. These subsequences can be defined on arbitrary biological sequences. For example, if X contains M sequences of length N, then the total number of contiguous patches in the data of length n is M(N−n) and, thus, the cardinality of S is M(N−n). For each patch x_(S), its index set S can be mapped to a hidden set of epitome indices T. In many instances contiguous patches x_(S) can be assumed to map to contiguous patches e_(T) in the epitome so the set T can be identified by the first index in the set. A number of possible mappings for each patch is defined by Me(Ne−n). For HIV amino acid sequence data, these subsequences generally are peptides that can correspond to epitopes. With T cell HIV vaccines, the patch length may be equal to the epitope length (e.g., 8-11 amino acids). However, the context in regions adjacent to the epitopes can affect HLA binding so the patch length may be longer, for example, up to about 33 amino acids.

The cost function employed by the learning component 230 to optimize the epitome depends on the application. For example, a cost function that accounts for various acts that are needed to mount an effective immune response can be utilized, wherein each act can have an associated cost in the form of an energy. This energy can be viewed as a negative log-probability of an event. By way of example, a cost function can be selected to account for the acts utilized to kill an infected cell, for example, the acts needed for a vaccine e to generate an effective immune response. The vaccine generally is chopped up by cellular mechanisms and short subsequences (e.g., epitopes) are presented on the surface of the processing cell. A positive immune response happens if the clone of the same T cell can later bind to a virus epitope x_(S) that an infected cell presents on its surface, initiating the killing of the infected cell.

In a cell processing a vaccine e, a peptide can be presented on the surface and bound to a T cell in a process with priming energy E(T). The priming energy typically is the sum of the cleavage, HLA binding, transport and/or T cell binding energies, which can influence priming of an appropriate T cell to attack a cell that presents an epitope pattern similar to e_(T). In addition, sequence data neighboring an epitope can have an impact on presentation and, thus, on the priming energy. A T cell primed with the vaccine epitope e_(T) typically attacks a cell that presents a virus epitope x_(S) in a process with attack energy E(x_(S), e_(T)). This energy depends on the cross-reactivity of the T cell. If the patch length is selected so as to account for each epitope plus its neighboring contextual sequence data, then only a piece of a window corresponding to the actual epitope can be utilized to determine the attack energy. The T cell attack energy is lowest when the epitope substantially matches the amino acid pattern on the T cell. The energy associated with priming with e_(T) and attacking x_(S) can be determined by summing the two energies E(T) and E(x_(S), e_(T)).

In general, for an effective immune response the energy for data set (e.g., many patches from many virus sequences) diversity and/or an ability to rapidly evolve can be considered. In particular, the total energy typically increases for each patch from the data set that does not have a corresponding patch in the epitome that gives a low priming plus attack energy. Equation 1 provides one example of an energy E(x) that satisfies this requirement. Equation  1: $\quad{{E(x)} = {\sum\limits_{S}{\min\limits_{T}{\left( {{E(T)} + {E\left( {x_{S},e_{T}} \right)}} \right).}}}}$ An effective vaccine can be obtained by finding an epitome that minimizes this energy. It is to be appreciated that Equation 1 is provided for illustrative purposes and sake of brevity, and does not limit the invention.

Each of the above energies (E(T) and E(x_(S), e_(T))) can be considered an energy associated with a stochastic process at equilibrium, wherein the energy is equal to a negative log-probability of the event or process. A suitable priming probability that can be employed in accordance with the subject invention is defined by Equation 2: p(T)∝exp(−E(T)),   Equation 2: and a suitable attack probability that can be employed in accordance with the subject invention can be defined by Equation 3: p(x_(S)|e_(T))∝exp(−E(x_(S), e_(T))).   Equation 3:

Exponentiating both sides of the above equations for the total energy E(x) renders Equation 4, which is a probability of the data set x in terms of the priming and attack probabilities: Equation  4: $\quad{{p(x)} \propto {\prod\limits_{S}^{\quad}\quad{\max\limits_{T}\left( {{p\left( {x_{S}\left. e_{T} \right){p(T)}} \right)},} \right.}}}$ which illustrates an expression that optimizes the epitome via maximizing the likelihood of independently generating all patches from the data set, wherein patch x_(S) is generated from epitome patch e_(T) with probability p(x_(S)|e_(T)) and patch e_(T) is selected from the epitome with probability p(T).

In instances where ΔE(x_(S), e_(T)) is relatively high (e.g., except for substantially perfect matches between x_(S) and e_(T)), the total energy can be closely approximated as const—rE, wherein r is the number of the patches x_(S) that match their corresponding epitome patch e_(T) and E is the binding energy for such matches. The foregoing can be derived by letting ΔE go to infinity uniformly across mismatches. The const term can depend on ΔE and/or the total number of patches K, and typically does not depend on the fraction of the matched patches. Thus, for a given size of the epitome, the quality of the vaccine can depend only on the percentage of the matched epitopes.

An exemplary functional form that can behave in this manner in the limit involves the letter substitution probability θ. This probability can be uniformly or non-uniformly spread over any or all other possibilities (e.g., other three nucleotides in case of DNA/RNA sequence models or other nineteen amino acids in case of protein models) as illustrated in Equation 5: p(x _(S) |e _(T))=θ^(|x) ^(s) ^(≠e) ^(T) ^(|)(1−θ)^(|x) ^(s) ^(=e) ^(T) ^(|),   Equation 5: wherein | | is the number of elements in the vector argument that are true, for example, |x_(S)=e_(T)| is the number of elements on which the two patches disagree. When the variability parameter θ can approach zero, an exact match model, which is a conservative choice for vaccine design as it limits the assumptions on cross-reactivity, can be utilized. The binding energy model corresponding to this distribution is illustrated in Equation 6: Equation  6: $\quad{{E_{x_{s},e_{T}} = {{- n}\quad\log\quad\left( {1 - \theta} \right)}},{{\Delta\quad E_{x_{s},e_{T}}} = {{{x_{ij} \neq e_{T{({ij})}}}}\log\quad{\frac{1 - \theta}{\theta}.}}}}$

With amino acid epitomes, the substitution parameter θ can be defined so that it decreases the probability of non-conservative amino acid exchange, thus reflecting to some extent the current understanding of the T cell cross-reactivity. The θ parameter can also be position-dependent. It is to be appreciated that there are other ways of describing the position-specific variability. For example, a full multinomial distribution over possible letters can be utilized in accordance with the subject invention. Utilizing this approach, the full multinomial distribution over possible letters, such as, for example, θA, θC, θT, θG, wherein θx is the probability of letter x at a given position and θA+θC+θT+θG=1 can be employed.

If the epitome is viewed as a stochastic model, the optimization criterion can be written as a likelihood of attacking all epitopes x_(S) as illustrated in Equation 7: Equation  7: $\quad{{p\left( \left\{ x_{S} \right\} \right)} = {\prod\limits_{S}^{\quad}\quad{\sum\limits_{T}{p\left( {x_{S}{\left. e_{T} \right).}} \right.}}}}$ Under a conservative assumption, wherein θ is approximated to equal to one, this cost can become equivalent to the epitome's coverage of substantially all virus epitopes. If the cost is defined in terms of the total energy barrier summed over substantially all virus epitopes x_(S), then the free energy can be defined as illustrated in Equation 8: Equation  8: $\quad{{F = {\sum\limits_{S}{\sum\limits_{T}{q\text{(}T\left. S \right)\quad\log\quad\frac{p\left( {T\left. S \right)} \right.}{p\left( {x_{S}\left. e_{T} \right){p(T)}} \right.}}}}},}$ which combines the binding energies described above via an auxiliary distribution q(T|S) for each data patch S.

Individual patch energies −log p(x_(S)|e_(T))−log p(T) can be summed to form an estimate of the total energy barrier to the immunity against all forms of the virus if the mapping variable T is known for each sequence fragment S. However, with some probability any piece of the epitome can be chopped and presented by cellular mechanisms and utilized to prime an appropriate T cell, which could later, as a memory cell, bind to an arbitrary HIV patch x_(S). Thus, similar segments of the epitome can potentially represent a substantially similar antigen x_(S). The distribution over the epitome correspondence is expressed through q(T|S). In order to compute the average energy over all mappings, an integration under q as a measure of posterior probability of matching the data epitopes to the appropriate epitome patches can be employed. In addition, if the epitome has multiple patches that represent some data epitope x_(S), such epitome can be more effective than an epitome that has only one way of providing adaptive immunity to this epitope. Thus, the entropy of the distribution q offsets the binding energy, and the free energy of the epitome sequence can be expressed as above. It is to be appreciated that although the epitome and the viruses can go through substantially similar acts, there is no total symmetry of S and T in Equation 8 when optimizing targeting all likely targets S in the virus instead of optimizing the intersection between epitome and a set of viruses.

The free energy minimum can be equal to the negative log likelihood as illustrated in Equation 9: ${{{Equation}\quad 9\text{:}}\quad - {\log\quad{p\left( \left\{ x_{S} \right\} \right)}}} = {\arg\quad{\max\limits_{q}{F.}}}$ Maximizing the likelihood with respect to the epitome e can be equivalent to minimizing the free energy with respect to the posterior distributions q(T|S) for all S and the epitome e. A suitable assignment in the posterior distribution q can require an exact match (e.g., θ=0).

It is to be appreciated that some epitopes are known, but many are not. By studying the escapes in genes, by using databases of epitopes that are known to be immunogenic for some HLA types, or by studying the MHC/cleavege/transport binding data, the probability p(S) can be associated with each peptide x_(S) in the data, for example, according to how likely the observed pattern is to be presented on the surface of the infected cell, which is the prerequisite for the T cell immunity. If a peptide is not going to be presented, it needs not be included in the epitome and the free energy is defined as illustrated in Equation 10: Equation  10: $\quad{F = {\sum\limits_{S}{{p(S)}{\sum\limits_{T}{q\text{(}T\left. S \right)\quad\log\quad{\frac{p\left( {T\left. S \right)} \right.}{p\left( {x_{S}\left. e_{T} \right){p(T)}} \right.}.}}}}}}$ Utilizing a conservative assumption (as discussed above), the vaccine optimization algorithm can be defined by Equation 11: Equation  11: $\quad{e = {\lim\limits_{\theta\rightarrow 0}\quad{\arg\quad{\min\limits_{e}\quad{\min\limits_{q}\quad{F.}}}}}}$

FIG. 3 illustrates a system 300 that determines epitomes via an expectation-maximization (EM) algorithm. The system 300 comprises an input component 310, a modeling engine 320, and a learning component 330. The input component 310 can receive patches and convey them to the modeling engine 320, which can utilize the sequences to determine the epitome. The modeling engine 320 can employ the learning component 330, which can utilize a cost function 340, an EM algorithm 350, and/or a greedy algorithm 360. The modeling engine 320 can employ the EM algorithm 350 to facilitate determining the epitome. For example, by considering the size of the epitome as prescribed (e.g., by vaccine the delivery constraints) and utilizing an initial random guess for the epitome parameters, the above can be performed via an iterative optimization by utilizing the EM algorithm 350.

By way of example, for each x_(S) the posterior distribution q of positions T can be estimated by Equation 12: Equation  12: $\quad{{q\text{(}T\left. S \right)} = {\frac{p\left( {{xS}\left. {eT} \right){p(T)}} \right.}{\sum\limits_{T}{p\left( {{xS}\left. {eT} \right){p(T)}} \right.}}.}}$ The epitome that minimizes the free energy can be re-estimated as illustrated in Equation 13 and Equation 14: Equation  13: $\quad{{e_{mn} = {\arg\quad{\max\limits_{e_{mn}}{\sum\limits_{{T{(i)}} = {({m,n})}}{q\text{(}T{\left. S \right)\left\lbrack {x_{s{(i)}} = e_{mn}} \right\rbrack}}}}}},{{and}{Equation}\quad 14\text{:}}}$ $\quad{\theta = {\frac{\sum\limits_{m,n}{\sum\limits_{s}{{p(S)}{\sum\limits_{{T{(i)}} = {({m,n})}}{q\left( {T{\left. S \right)\left\lbrack {x_{S{(i)}} \neq e_{mn}} \right\rbrack}} \right.}}}}}{\sum\limits_{m,n}{\sum\limits_{s}{{p(S)}{\sum\limits_{{T{(i)}} = {({m,n})}}{q\left( {T\left. S \right)} \right.}}}}}.}}$ Iterating these equations is an expectation maximization (EM) algorithm for the epitome model, which reduces the free energy in each act, thus converging to the local minimum of the free energy and the local maximum of the likelihood.

The EM algorithm 350 can jointly and concurrently optimize both the epitome and the binding energy parameters θ. The algorithm can be initialized with a random epitome and a relatively large variability estimate θ. After several iterations, θ generally decreases as the epitome starts to more closely match the data and the uncertainty contracts. The energy barrier ΔE_(x) _(S) _(,e) _(T) to non-exact matches can become relatively steep capturing the conservative assumption on high T cell specificity. If the epitome is not long enough, then the algorithm decreases the allowed variability (and thus increases specificity) to a level where the balance between covering all the data and allowing for as little cross-reactivity as possible is reached for the assumed energy model. The variability can be further decreased to force the model to fit as many patches as possible without any latitude on cross-reactivity. It is to be appreciated that various other algorithms such as the greedy algorithm, Hidden Markov model, neural network, and/or Bayesian-based algorithms can be utilized in accordance with an aspect of the subject invention. For example, the greedy algorithm can be utilized to jointly update the size of the epitome sequence or sequences and the free energy in a greedy fashion.

Optionally, an intelligence component 370 can be employed in accordance with an aspect of the invention. In one instance, the intelligence component 370 can be utilized to facilitate determining which learning algorithm to employ. For example, the machine learning component 360 can provide various cost functions, expectation-maximization algorithms, greedy algorithms, etc. as described above. The intelligence component 370 can determine which algorithm(s) should be employed, for example, based on a desired vaccine, a set of input patches, epitope length, etc. In addition, the intelligence component 370 can perform a utility-based analysis in connection with selecting an algorithm to utilize, with determining an epitome, and/or with optimizing an epitome.

In another aspect of the invention, the intelligent component 370 can perform a probabilistic and/or statistic-based analysis in connection with inferring and/or determining a suitable machine learning algorithm and/or an epitome. As utilized herein, the term “inference” and variations thereof refer generally to the process of reasoning about or inferring states of the system, environment, and/or user from a set of observations as captured via events and/or data. Inference can be employed to identify a specific context or action, or can generate a probability distribution over states, for example. The inference can be probabilistic—that is, the computation of a probability distribution over states of interest based on a consideration of data and events. Inference can also refer to techniques employed for composing higher-level events from a set of events and/or data. Such inference results in the construction of new events or actions from a set of observed events and/or stored event data, whether or not the events are correlated in close temporal proximity, and whether the events and data come from one or several event and data sources. Various classification (explicitly and/or implicitly trained) schemes and/or systems (e.g., support vector machines, neural networks, expert systems, Bayesian belief networks, fuzzy logic, data fusion engines . . . ) can be employed in connection with performing automatic and/or inferred action in connection with the subject invention.

FIG. 4 illustrates a methodology 400 that determines epitomes for pathogens such as HIV. For simplicity of explanation, the methodology is depicted and described as a series of acts. It is to be understood and appreciated that the present invention is not limited by the acts illustrated and/or by the order of acts, for example acts can occur in various orders and/or concurrently, and with other acts not presented and described herein. Furthermore, not all illustrated acts may be required to implement the methodology in accordance with the present invention. In addition, those skilled in the art will understand and appreciate that the methodology could alternatively be represented as a series of interrelated states via a state diagram or events.

At 410, a plurality of patches, or sequences, which can be a subset or all of a population of sequences, is received. Such patches can be variable length, for example, nine-mers, ten-mers, etc. At 420, various learning algorithms can be utilized to determine the epitome, based on the received sequences. For examples, learning algorithms such as a cost function (as described herein), an expectation-maximization (EM) algorithm (as described herein), a greedy algorithm, Bayesian models, Hidden Markov models, neural networks, etc. can be employed in connection with various aspect of the subject invention. It is to be appreciated that the resultant epitome can be a most likely epitome such as an epitome that includes a sequence with the greatest coverage, a shortest sequence for a particular coverage, etc. At reference numeral 430, the epitome can be output. It is to be appreciated that such an epitome can be utilized to create peptide and/or nucleotide sequencing to generate an AIDS vaccine cocktail. This novel approach can provide for improvements over traditional techniques by modeling sequence diversity through machine learning. Resulting vaccines (for HIV) can provide for higher epitope coverage in comparison with the cocktails of consensi, phylogenetic tree nodes and random strains from the data.

FIG. 5 illustrates an exemplary epitome 500 and a plurality of patches (sequences) 510 that the epitome 500 epitomizes in terms of linear nine-amino acid epitopes, assuming that all nine-mers are equally immunogenic and exposure to the immune system leads to no cross-reactivity. Although nine-mers are depicted, it is to be appreciated that essentially any mer (e.g., ten-mers, eleven-mers, etc.) can be utilized in various aspects of the subject invention, and any or all assumptions can be relaxed. As illustrated at 520, 530, 540 and 550, three portions of the epitome 500 can be matched with various portions of the plurality of sequences. Such matching can be achieved by moving a window (e.g., nine-long, as depicted in FIG. 5) over the epitome, for example, from left to right. While moving the windowing, the window can be matched with a corresponding sequence epitopes. The epitome 500 can be estimated from the data by chopping up the input sequences 510 into short peptides of epitope length or longer and creating a mosaic sequence longer than any given data sequence, but much shorter than the sum of all input sequence lengths. It is to be appreciated that even though it may be desirable to achieve coverage of short epitopes, due to the overlaps in these epitopes in the data, the epitome may favor conservation of long amino acid stretches from the epitomized sequences. Therefore, the epitome can also be viewed as a collection of longer or shorter protein pieces needed to compose each of the given sequences.

FIG. 6 depicts a graph 600 that illustrates epitome coverage of a plurality of different CAG genes over length, and FIG. 7 depicts a graph 700 that illustrates epitome coverage of various epitopes of a GAG gene over length. In these figures, respective axes 610 and 710 correspond to coverage as a function of percent and respective axes 620 and 720 corresponds to length. In this example, epitomes of size 1×Ne can be utilized. However, as a vaccine the epitome may need to be delivered in a different format, which can be achieved by chopping the 1×Ne epitome into smaller pieces or directly optimizing an epitome of a required format as described herein. The patches derived from the sequence data can include all possible contiguous amino acid subsequences, for example, of size nine, corresponding to the length of a typical epitope, with indices S=11, 12, . . . , 19. In order to include a context that can affect escape, the patches may need to be longer. However, optimizing for coverage of shorter patches can lead to preservation of a larger context around any or all patches due to patch overlaps both in data and in the epitome. To compute various vaccine components, an expectation-maximization (EM) algorithm, a greedy algorithm, and the like can be utilized to train a mixture of profile sequences, for example, sequences in which each site has an associated most likely letter and a probability of generating any other letter.

Epitomes of various sizes can be utilized, wherein such epitomes can be constructed by iteratively increasing the size of the epitome and decreasing the free energy with the assumption θ=0, thus increasing coverage of the epitopes from the data. Respective acts can be optimal incremental moves, for example, by adding a most frequent data patch that is not yet included in the epitome. This optimization follows a conservative assumption that none of the epitopes in the sampled viruses should be a priori ignored in an effective vaccine (e.g., p(S)=const) and only an exact copy of epitope in the vaccine will lead to an effective vaccine (θ=0). Thus, the efficiency of the optimization algorithms can be evaluated by a percentage of the data patches that are exactly copied in the epitome. As discussed previously, coverage is related to the free energy and can be more intuitive when θ=0.

In order to provide additional context for implementing various aspects of the present invention, FIG. 8 and the following discussion is intended to provide a brief, general description of a suitable computing environment in which the various aspects of the present invention may be implemented. While the invention has been described above in the general context of computer-executable instructions of a computer program that runs on a local computer and/or remote computer, those skilled in the art will recognize that the invention also may be implemented in combination with other program modules. Generally, program modules include routines, programs, components, data structures, etc., that perform particular tasks and/or implement particular abstract data types.

Moreover, those skilled in the art will appreciate that the inventive methods may be practiced with other computer system configurations, including single-processor or multi-processor computer systems, minicomputers, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based and/or programmable consumer electronics, and the like, each of which may operatively communicate with one or more associated devices. The illustrated aspects of the invention may also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. However, some, if not all, aspects of the invention may be practiced on stand-alone computers. In a distributed computing environment, program modules may be located in local and/or remote memory storage devices.

With reference to FIG. 8, an exemplary environment 800 for implementing various aspects of the invention includes a computer 812. The computer 812 includes a processing unit 814, a system memory 816, and a system bus 818. The system bus 818 couples system components including, but not limited to, the system memory 816 to the processing unit 814. The processing unit 814 can be any of various available processors. Dual microprocessors and other multiprocessor architectures also can be employed as the processing unit 814.

The system bus 818 can be any of several types of bus structure(s) including the memory bus or memory controller, a peripheral bus or external bus, and/or a local bus using any variety of available bus architectures including, but not limited to, Industrial Standard Architecture (ISA), Micro-Channel Architecture (MSA), Extended ISA (EISA), Intelligent Drive Electronics (IDE), VESA Local Bus (VLB), Peripheral Component Interconnect (PCI), Card Bus, Universal Serial Bus (USB), Advanced Graphics Port (AGP), Personal Computer Memory Card International Association bus (PCMCIA), Firewire (IEEE 1394), and Small Computer Systems Interface (SCSI).

The system memory 816 includes volatile memory 820 and nonvolatile memory 822. The basic input/output system (BIOS), containing the basic routines to transfer information between elements within the computer 812, such as during start-up, is stored in nonvolatile memory 822. By way of illustration, and not limitation, nonvolatile memory 822 can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM), or flash memory. Volatile memory 820 includes random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, RAM is available in many forms such as synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and direct Rambus RAM (DRRAM).

Computer 812 also includes removable/non-removable, volatile/non-volatile computer storage media. FIG. 8 illustrates, for example a disk storage 824. Disk storage 824 includes, but is not limited to, devices like a magnetic disk drive, floppy disk drive, tape drive, Jazz drive, Zip drive, LS-100 drive, flash memory card, or memory stick. In addition, disk storage 824 can include storage media separately or in combination with other storage media including, but not limited to, an optical disk drive such as a compact disk ROM device (CD-ROM), CD recordable drive (CD-R Drive), CD rewritable drive (CD-RW Drive) or a digital versatile disk ROM drive (DVD-ROM). To facilitate connection of the disk storage devices 824 to the system bus 818, a removable or non-removable interface is typically used such as interface 826.

It is to be appreciated that FIG. 8 describes software that acts as an intermediary between users and the basic computer resources described in the suitable operating environment 800. Such software includes an operating system 828. Operating system 828, which can be stored on disk storage 824, acts to control and allocate resources of the computer system 812. System applications 830 take advantage of the management of resources by operating system 828 through program modules 832 and program data 834 stored either in system memory 816 or on disk storage 824. It is to be appreciated that the present invention can be implemented with various operating systems or combinations of operating systems.

A user enters commands or information into the computer 812 through input device(s) 836. Input devices 836 include, but are not limited to, a pointing device such as a mouse, trackball, stylus, touch pad, keyboard, microphone, joystick, game pad, satellite dish, scanner, TV tuner card, digital camera, digital video camera, web camera, and the like. These and other input devices connect to the processing unit 814 through the system bus 818 via interface port(s) 838. Interface port(s) 838 include, for example, a serial port, a parallel port, a game port, and a universal serial bus (USB). Output device(s) 840 use some of the same type of ports as input device(s) 836. Thus, for example, a USB port may be used to provide input to computer 812, and to output information from computer 812 to an output device 840. Output adapter 842 is provided to illustrate that there are some output devices 840 like monitors, speakers, and printers, among other output devices 840, which require special adapters. The output adapters 842 include, by way of illustration and not limitation, video and sound cards that provide a means of connection between the output device 840 and the system bus 818. It should be noted that other devices and/or systems of devices provide both input and output capabilities such as remote computer(s) 844.

Computer 812 can operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 844. The remote computer(s) 844 can be a personal computer, a server, a router, a network PC, a workstation, a microprocessor based appliance, a peer device or other common network node and the like, and typically includes many or all of the elements described relative to computer 812. For purposes of brevity, only a memory storage device 846 is illustrated with remote computer(s) 844. Remote computer(s) 844 is logically connected to computer 812 through a network interface 848 and then physically connected via communication connection 850. Network interface 848 encompasses wire and/or wireless communication networks such as local-area networks (LAN) and wide-area networks (WAN). LAN technologies include Fiber Distributed Data Interface (FDDI), Copper Distributed Data Interface (CDDI), Ethernet, Token Ring and the like. WAN technologies include, but are not limited to, point-to-point links, circuit switching networks like Integrated Services Digital Networks (ISDN) and variations thereon, packet switching networks, and Digital Subscriber Lines (DSL).

Communication connection(s) 850 refers to the hardware/software employed to connect the network interface 848 to the bus 818. While communication connection 850 is shown for illustrative clarity inside computer 812, it can also be external to computer 812. The hardware/software necessary for connection to the network interface 848 includes, for exemplary purposes only, internal and external technologies such as, modems including regular telephone grade modems, cable modems and DSL modems, ISDN adapters, and Ethernet cards.

As utilized in this application, terms “component,” “system,” “engine,” and the like are intended to refer to a computer-related entity, either hardware, software (e.g., in execution), and/or firmware. For example, a component can be a process running on a processor, a processor, an object, an executable, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components can reside within a process and a component can be localized on one computer and/or distributed between two or more computers.

What has been described above includes examples of the present invention. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the present invention, but one of ordinary skill in the art may recognize that many further combinations and permutations of the present invention are possible. Accordingly, the present invention is intended to embrace all such alterations, modifications, and variations that fall within the spirit and scope of the appended claims.

In particular and in regard to the various functions performed by the above described components, devices, circuits, systems and the like, the terms (including a reference to a “means”) used to describe such components are intended to correspond, unless otherwise indicated, to any component which performs the specified function of the described component (e.g., a functional equivalent), even though not structurally equivalent to the disclosed structure, which performs the function in the herein illustrated exemplary aspects of the invention. In this regard, it will also be recognized that the invention includes a system as well as a computer-readable medium having computer-executable instructions for performing the acts and/or events of the various methods of the invention.

In addition, while a particular feature of the invention may have been disclosed with respect to only one of several implementations, such feature may be combined with one or more other features of the other implementations as may be desired and advantageous for any given or particular application. Furthermore, to the extent that the terms “includes,” and “including” and variants thereof are used in either the detailed description or the claims, these terms are intended to be inclusive in a manner similar to the term “comprising.” 

1. A system that facilitates determining a vaccine cocktail, comprising: a component that receives a plurality of patches corresponding to a set of subsequences from one or more pathogen sequences in a population; and a modeling component that employs one or more machine learning algorithms to determine an epitome based on the plurality of patches, the epitome providing the basis for the vaccine cocktail.
 2. The system of claim 1, wherein the plurality of patches are pathogen subsequences assembled to generate representative sequences of a desired category.
 3. The system of claim 2, wherein the category comprises at least one of sequences associated with a specific species, sequences associated with a specific clade, sequences associated with an acute phase of infection, and sequences associated with a chronic phase of infection.
 4. The system of claim 2, wherein the category comprises HIV.
 5. The system of claim 1, wherein at least one of the pathogen subsequences relates to an epitope.
 6. The system of claim 1, wherein at least one of the pathogen subsequences comprises an epitope.
 7. The system of claim 1, wherein the plurality of patches comprise short subsequences, at least one of which contains an unknown epitope according to a probability.
 8. The system of claim 1, wherein at least one of the one or more machine learning algorithms minimizes a cost function.
 9. The system of claim 8, wherein the epitome has a minimum cost function for a given length.
 10. The system of claim 1, wherein at least one of the one or more machine learning algorithms minimizes the length of the epitome, the minimization subject to the constraint that the resulting epitome has a cost less than or equal to a given cost.
 11. The system of claim 8, wherein the cost function measures a similarity between the plurality of patches and an estimate of the epitome.
 12. The system of claim 8, wherein the cost function is a free energy.
 13. The system of claim 9, wherein the cost function is a free energy.
 14. The system of claim 12, wherein the free energy is calculated according to an equation having a term p(S), the term p(S) comprising at least one of: a frequency of occurrence of a patch x_(S) in the population; a probability that patch x_(S) is found in a single strain of the population; a probability of occurrence of patch x_(S) in a population wherein the sequencing data is ambiguous; a value that reflects both the frequency of patch x_(S) and whether patch x_(S) contains a known epitope; a probability that patch x_(S) is an epitope; a probability that patch x_(S) will be presented by a cell; and a probability that an individual vaccinated with patch x_(S) will mount an immune response.
 15. The system of claim 12, wherein the free energy is calculated according to an equation having a term p(S), the term p(S) comprising a combination of at least two of: a frequency of occurrence of a patch x_(S) in the population; a probability that patch x_(S) is found in a single strain of the population; a probability of occurrence of patch x_(S) in a population wherein the sequencing data is ambiguous; a value that reflects both the frequency of patch x_(S) and whether patch x_(S)contains a known epitope; a probability that patch x_(S) is an epitope, a probability that patch x_(S) will be presented by a cell; and a probability that an individual vaccinated with patch x_(S) will mount an immune response.
 16. The system of claim 12, wherein the free energy is calculated according to an equation having a term p(S), the term p(S) comprising a product of at least two of: a frequency of occurrence of a patch x_(S) in the population; a probability that patch x_(S) is found in a single strain of the population; a probability of occurrence of patch x_(S) in a population wherein the sequencing data is ambiguous; a value that reflects both the frequency of patch x_(S) and whether patch x_(S) contains a known epitope; a probability that patch x_(S) is an epitope; a probability that patch x_(S) will be presented by a cell; and a probability that an individual vaccinated with patch x_(S) will mount an immune response.
 17. The system of claim 12, wherein the free energy is calculated according to an equation having a term p(S), the term p(S) comprising a term that depends on the molecular binding energies.
 18. The system of claim 13, wherein the free energy is calculated according to an equation having a term p(S), the term p(S) further comprising at least one of: a frequency of occurrence of a patch x_(S) in the population; a probability that patch x_(S) is found in a single strain of the population; a probability of occurrence of patch x_(S) in a population wherein the sequencing data is ambiguous; a value that reflects both the frequency of patch x_(S) and whether patch x_(S) contains a known epitope; a probability that patch x_(S) is an epitope; a probability that patch x_(S) will be presented by a cell; and a probability that an individual vaccinated with patch x_(S) will mount an immune response.
 19. The system of claim 13, wherein the free energy is calculated according to an equation having a term p(S), the term p(S) further comprising a combination of at least two of: a frequency of occurrence of a patch x_(S) in the population; a probability that patch x_(S) is found in a single strain of the population; a probability of occurrence of patch x_(S) in a population wherein the sequencing data is ambiguous; a value that reflects both the frequency of patch x_(S) and whether patch x_(S) contains a known epitope; a probability that patch x_(S) is an epitope; a probability that patch x_(S) will be presented by a cell; and a probability that an individual vaccinated with patch x_(S) will mount an immune response.
 20. The system of claim 13, wherein the free energy is calculated according to an equation having a term p(S), the term p(S) further comprising a product of at least two of: a frequency of occurrence of a patch x_(S) in the population; a probability that patch x_(S) is found in a single strain of the population; a probability of occurrence of patch x_(S) in a population wherein the sequencing data is ambiguous; a value that reflects both the frequency of patch x_(S) and whether patch x_(S) contains a known epitope; a probability that patch x_(S) is an epitope; a probability that patch x_(S) will be presented by a cell; and a probability that an individual vaccinated with patch x_(S) will mount an immune response.
 21. The system of claim 13, wherein the free energy is calculated according to an equation having a term p(S), the term p(S) further comprising a term that depends on the molecular binding energies.
 22. The system of claim 8, wherein the cost function measures an inverse similarity of the plurality of patches with an estimate of the epitome.
 23. The system of claim 9, wherein the cost function measures an inverse similarity of the plurality of patches with an estimate of the epitome.
 24. The system of claim 10, wherein the cost function measures an inverse similarity of the plurality of patches with an estimate of the epitome.
 25. The system of claim 8, wherein the cost function is determined according to at least one of equality, a hamming distance of less than a fixed integer, corresponding letters, a probability distribution over corresponding letter, and an energy of molecular binding between an element of the immune system and a patch.
 26. The system of claim 8, wherein the cost function is determined according to a probability of patch x_(S) given patch e_(T).
 27. The system of claim 8, wherein the cost function is determined according to a probability density function of patch x_(S) given patch e_(T).
 28. The system of claim 8, wherein the cost function comprises an expected fraction of the plurality of patches relating to one or more strains of the population and wherein expectation is taken over the probability that a patch contains an epitope.
 29. The system of claim 9, wherein the cost function comprises an expected fraction of the plurality of patches relating to one or more strains of the population and wherein expectation is taken over the probability that a patch contains an epitope.
 30. The system of claim 8, wherein the cost function between patches x_(S) and e_(T) is an exponential of a binding energy reflecting the binding of a T-cell primed with one peptide to another peptide.
 31. The system of claim 1, wherein the one or more machine learning algorithms are at least one of an expectation-maximization (EM) algorithm and a greedy algorithm.
 32. The system of claim 31, wherein the greedy algorithm comprises building the epitome using the plurality of patches by iteratively increasing the epitome such that at each iteration one patch is appended to the epitome so as to decrease a cost function.
 33. The system of claim 32, wherein appending one patch to the epitome includes overlap.
 34. These system of claim 31, wherein the greedy algorithm comprises building the eptiome using the plurality of patches by iteratively increasing the epitome such that at each iteration, a patch selected from the plurality of patches is added, the patch that is added is selected to minimize the product of a new cost and a new length.
 35. The system of claim 31, wherein the greedy algorithm is a split-and-merge algorithm.
 36. The system of claim 35, wherein the split-and-merge algorithm comprises adding a patch selected from the plurality of patches to the epitome, the patch that is added being the patch that minimizes the product of a new cost and a new length.
 37. The system of claim 1, the plurality of patches comprising variable length peptides.
 38. The system of claim 1, further comprising an intelligence component to optimize the epitome based on one or more of statistics, probabilities, inferences, and utility-based analyses.
 39. The system of claim 1, wherein the one or more machine learning algorithms model sequence diversity for the pathogen sequences in the population.
 40. The system of claim 1, wherein the epitome is an AIDS vaccine cocktail.
 41. The system of claim 1, wherein the one or more machine learning algorithms optimize the epitome by maximizing a number of short subsequences that are present in the plurality of patches.
 42. The system of claim 1, wherein the pathogen sequences are peptides and a length of at least one patch is about 8-11 amino acids.
 43. The system of claim 1, wherein the one or more machine learning algorithms account for various acts needed for a particular immune response, wherein respective acts are associated with individual costs in the form of energy.
 44. The system of claim 43, wherein the energy is a negative log-probability of an event.
 45. Computer-executable instructions for performing a computer-implemented method to facilitate vaccine design, the computer-executable instructions stored on computer-readable media, the computer-implemented method comprising: receiving a plurality of patches to one or more learning algorithms; determining an epitome based on the plurality of patches by employing the one or more learning algorithms; and utilizing the epitome to design a vaccine.
 46. The method of claim 45, wherein the vaccine is an AIDS vaccine.
 47. The method of claim 45, further comprising matching a portion of the epitome to at least one region of at least one patch.
 48. The method of claim 47, wherein matching the portion of the epitome to the at least one region of at least one patch comprising moving a window over the epitome to match the portion of the epitome to the at least one region of the at least one of patch.
 49. The method of claim 46, further comprising parsing at least one of the patches into shorter sequences of epitope length.
 50. The method of claim 46, wherein the epitome is a mosaic sequence with a length greater than a length of any individual patch, but less than a sum of all patch lengths.
 51. The method of claim 46, wherein at least one learning algorithm minimizes a cost function.
 52. The method of claim 46, wherein at least one learning algorithm is an expectation-maximization (EM) algorithm.
 53. The method of claim 46, wherein at least one learning algorithm is a greedy algorithm.
 54. The method of claim 46, further comprising packing patches of a defined length into the epitome.
 55. The method of claim 46, wherein the epitome is an HIV vaccine cocktail.
 56. The method of claim 46, further comprising optimizing the epitome by maximizing a number of short subsequences that are present in the plurality of patches.
 57. A system that facilitates generating vaccine cocktails for rapidly evolving pathogens, comprising: means for receiving a plurality of patches having sequences; and means for employing machine learning to model sequence diversity to facilitate AIDS vaccine cocktail assembly. 